Provably Secure Identity-based Aggregate Signcryption Scheme in Random Oracles

This article proposes a provably secure aggregate signcryption scheme in random oracles. Security of the scheme is based on computational infeasibility of solving Decisional Bilinear Diffie-Hellman Problem and Discrete Logarithm Problems. Confidentiality and authenticity are two fundamental security requirements of Public key Cryptography. These are achieved by encryption scheme and digital signatures respectively. Signcryption is a cryptographic protocol that carries out signature and encryption simultaneously in a single logical step. An aggregate signcryption scheme can be constructed of the aggregation of individual signcryption. The aggregation is done taking n distinct signcryptions on n messages signed by n distinct users.